LD: Identifying Misbehaving Nodes in MANET

A mobile ad-hoc network is a collection of mobile nodes connected together over a wireless medium without any fixed infrastructure. Unique characteristics of mobile ad-hoc networks such as open peer-to-peer network architecture, shared wireless medium and highly dynamic topology, pose various challenges to the security design. Mobile ad-hoc networks lack central administration or control, making them very vulnerable to attacks or disruption by faulty nodes in the absence of any security mechanisms. Also, the wireless channel in a mobile ad-hoc network is accessible to both legitimate network users and malicious attackers. So, the task of finding good solutions for these challenges plays a critical role in achieving the eventual success of mobile ad-hoc networks. However, the open medium and wide distribution of nodes make MANET vulnerable to malicious attackers. In this case, it is crucial to develop efficient intrusion-detection mechanisms to protect MANET from attacks. Secure routing protocols and mechanisms to detect routing misbehavior in the direct neighborhood exist; however, collusion of misbehaving nodes has not been adequately addressed yet. We present LeakDetector, a mechanism to detect colluding malicious nodes in wireless multihop networks A mobile ad-hoc network is a collection of mobile nodes connected together over a wireless medium without any fixed infrastructure. Unique characteristics of mobile ad-hoc networks such as open peer-to-peer network architecture, shared wireless medium and highly dynamic topology, pose various challenges to the security design. Mobile ad-hoc networks lack central administration or control, making them very vulnerable to attacks or disruption by faulty nodes in the absence of any security mechanisms. Also, the wireless channel in a mobile ad-hoc network is accessible to both legitimate network users and malicious attackers. So, the task of finding good solutions for these challenges plays a critical role in achieving the eventual success of mobile ad-hoc networks. However,the. LeakDetector enables the calculation of the packet-loss ratio for the individual nodes

Detecting Targeted Malicious Email Through Mail Client

Sharing and storing of data in the web world is with the help of social networks. Messages are exchanged between hosts using the Simple Mail Transfer Protocol (SMTP). While the email messages are transporting between systems, SMTP communicates delivery parameters using a message envelope separate from the message (header and body) itself. A malicious email message is the one which have been deliberately crafted to cause problems on the server or at the client side. This message may contain a virus. A filtering technique is applied on messaging string contents by applying tokenization and then applying naïve bayesian classifier we classify targeted and non targeted malicious email. A network defender encounters different classes of threat actors with varying intents and capabilities. Conventional computer network attacks exploit network-based listening services such as Web servers. Traditional decision-tree classification algorithms split each node using the best split from all available features. With random forests, each node splits from a randomly selected set of features at that node. It is only focus on mail body not on hyperlinks and attachments. Proposed extension is feature extraction to file attachment metadata. Threat actors might inadvertently leave remnants of infor-mation such as file paths, time zones, or even author names. In addi¬tion, organizations can track features that characterize the types and amounts of email received by a particular email address

Enhanced Document Search and Sharing Tool in Organized P2p Frameworks

In internet p2p file sharing system generating more traffic. in this system file querying is important functionality which indicates the performance of p2p system .To improve file query performance cluster the common interested peers based on physical proximity .Existing methods are dedicated to only unstructured p2p systems and they don’t have strict policy for topology construction which decreases the file location efficiency. In this project proposing a proximity aware interest –clustered p2p file sharing system implemented in structured p2p file system. It forms a cluster based on node proximity as well as groups the nodes which having common interest into sub-cluster. A novel lookup function named as DHT and file replication algorithm which supports efficient file lookup and access. To reduce overhead and file searching delay the file querying may become inefficient due to the sub-interest supernode overload or failure. Thus, though the sub-interest based file querying improves querying efficiency, it is still not sufficiently scalable when there are a very large number of nodes in a sub-interest group. We then propose a distributed intra-sub-cluster file querying method in order to further improve the file querying efficiency